Determining the Winner of a Dodgson Election is Hard
نویسندگان
چکیده
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we resolve two open problems regarding the parameterized complexity of DODGSON SCORE. We show that DODGSON SCORE parameterized by the target score value k has no polynomial kernel unless the polynomial hierarchy collapses to the third level; this complements a result of Fellows, Rosamond and Slinko who obtain a non-trivial kernel of exponential size for this problem. We also prove that DODGSON SCORE parameterized by the number n of votes is hard for W[1].
منابع مشابه
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
Dodgson’s election system elegantly satisfies the Condorcet criterion. However, determining the winner of a Dodgson election is known to be Θp 2 -complete ([HHR97], see also [BTT89]), which implies that unless P = NP no polynomial-time solution to this problem exists, and unless the polynomial hierarchy collapses to NP the problem is not even in NP. Nonetheless, we show that when the number of ...
متن کاملThe control complexity of sincere strategy preference based approval voting and of fallback voting, and a study of optimal lobbying and Junta distributions for SAT
While voting systems were originally used in political science, they are now also of central importance in various areas of computer science, such as artificial intelligence (in particular within multiagent systems). Brams and Sanver [BS06] introduced sincere-strategy preference-based approval voting (SP-AV) and fallback voting (FV), two election systems which combine the preference rankings of...
متن کاملParameterized Computational Complexity of Dodgson and Young Elections
We show that, other than for standard complexity theory with known NP-completeness results, the computational complexity of the Dodgson and Young election systems is completely different from a parameterized complexity point of view. That is, on the one hand, we present an efficient fixed-parameter algorithm for determining a Condorcet winner in Dodgson elections by a minimum number of switches...
متن کاملApproximability and Inapproximability of Dodgson and Young Elections
The voting rules proposed by Dodgson and Young are both designed to find the candidate closest to being a Condorcet winner, according to two different notions of proximity; the score of a given candidate is known to be hard to compute under both rules. In this paper, we put forward an LP-based randomized rounding algorithm which yields an O(logm) approximation ratio for the Dodgson score, where...
متن کاملThe Hebrew University of Jerusalem Approximability and Inapproximability of Dodgson and Young Elections
The voting rules proposed by Dodgson and Young are both designed to find the candidate closest to being a Condorcet winner, according to two different notions of proximity; the score of a given candidate is known to be hard to compute under both rules. In this paper, we put forward an LP-based randomized rounding algorithm which yields an O(log m) approximation ratio for the Dodgson score, wher...
متن کامل